Sparse FIR Filter Design Based on Simulated Annealing Algorithm
نویسندگان
چکیده
منابع مشابه
FIR digital filter design based on quantum bee colony algorithm
In order to resolve the multi-parameter optimization problem of finite impulse response (FIR) digital filter design, a quantum bee colony algorithm (QBCA) is proposed. The proposed QBCA is a multi-dimensional search algorithm for optimization of real numbers, and uses mechanisms of quantum evolution to update the positions of different quantum bees. Computer simulations have showed that FIR dig...
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملAN EFFICIENT HYBRID ALGORITHM BASED ON PARTICLE SWARM AND SIMULATED ANNEALING FOR OPTIMAL DESIGN OF SPACE TRUSSES
In this paper, an efficient optimization algorithm is proposed based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to optimize truss structures. The proposed algorithm utilizes the PSO for finding high fitness regions in the search space and the SA is used to perform further investigation in these regions. This strategy helps to use of information obtained by swarm in an opt...
متن کاملOn the Design of an Adaptive Simulated Annealing Algorithm
In this paper, we demonstrate the ease in which an adaptive simulated annealing algorithm can be designed. Specifically, we use the adaptive annealing schedule known as the modified Lam schedule to apply simulated annealing to the weighted tardiness scheduling problem with sequence-dependent setups. The modified Lam annealing schedule adjusts the temperature to track the theoretical optimal rat...
متن کاملSynthesis of Sparse Cylindrical Arrays Using Simulated Annealing Algorithm
Abstract—In this paper, simulated annealing algorithm (SA) is applied to the synthesis of cylindrical conformal arrays in order to suppress the peaks of side lobes by acting on the elements’ positions. There are multiple optimization constraints including the number of elements, aperture and minimum element spacing. A constraint matrix is designed to make the solution meet the restriction on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Electrical and Computer Engineering
سال: 2015
ISSN: 1582-7445,1844-7600
DOI: 10.4316/aece.2015.01003